Propositional Merging and Judgment Aggregation: Two Compatible Approaches?
نویسندگان
چکیده
There are two theories of aggregation of logical formulae: merging and judgment aggregation. In this work we investigate the relationships between these theories; one of our objectives is to point out some correspondences/discrepancies between the associated rationality properties.
منابع مشابه
Belief Merging versus Judgment Aggregation
The problem of aggregating pieces of propositional information coming from several agents has given rise to an intense research activity. Two distinct theories have emerged. On the one hand, belief merging has been considered in AI as an extension of belief revision. On the other hand, judgment aggregation has been developed in political philosophy and social choice theory. Judgment aggregation...
متن کاملDA2 merging operators
A new framework for propositional merging is presented. DA2 merging operators, parameterized by a distance between interpretations and two aggregation functions, are introduced. Many distances and aggregation functions can be used and many merging operators already defined in the literature (including both model-based ones and syntax-based ones) can be encoded as specific DA2 operators. Both lo...
متن کاملJudgement Aggregation in Dynamic Logic of Propositional Assignments
Judgment aggregation studies situations where groups of agents take a collective decision over a number of logically interconnected issues. A recent stream of papers is dedicated to modelling frameworks of social choice theory, including judgment aggregation, within logical calculi usually designed ad hoc for this purpose. In contrast, we propose the use of dynamic logic of propositional assign...
متن کاملCorrespondences in the Theory of Aggregation
The paper studies the interrelationships between the social-theoretic problems of preference and judgment aggregation from the perspective of formal logic. The result of the paper is twofold. On the one hand, preference aggregation on total preorders is proven equivalent to the aggregation of specific types of judgments. On the other hand, judgment aggregation on propositional logic is proven e...
متن کاملPropositional merging operators based on set-theoretic closeness
In the propositional setting, a well-studied family of merging operators are distance-based ones: the models of the merged base are the closest interpretations to the given profile. Closeness is, in this context, measured as a number resulting from the aggregation of the distances to each base of the profile. In this work we define a new familly of propositional merging operators, close to such...
متن کامل